Measure and probability for concurrency theoristsPANANGADEN, Prakash.Theoretical computer science. 2001, Vol 253, Num 2, pp 287-309, issn 0304-3975Article

Reasoning about quantum knowledgeD'HONDT, Ellie; PANANGADEN, Prakash.Lecture notes in computer science. 2005, pp 553-564, issn 0302-9743, isbn 3-540-30495-9, 1Vol, 12 p.Conference Paper

On the expressive power of first-order boolean functions in PCFPUCELLA, Riccardo; PANANGADEN, Prakash.Theoretical computer science. 2001, Vol 266, Num 1-2, pp 543-567, issn 0304-3975Article

Weak bisimulation is sound and complete for pCTLDESHARNAIS, Josée; GUPTA, Vineet; JAGADEESAN, Radha et al.Information and computation (Print). 2010, Vol 208, Num 2, pp 203-219, issn 0890-5401, 17 p.Article

The measurement calculusDANOS, Vincent; KASHEFI, Elham; PANANGADEN, Prakash et al.Journal of the Association for Computing Machinery. 2007, Vol 54, Num 2, pp 1-45, issn 0004-5411, 45 p.Article

The One Way to Quantum ComputationDANOS, Vincent; KASHEFI, Elham; PANANGADEN, Prakash et al.Lecture notes in computer science. 2006, pp 13-21, issn 0302-9743, isbn 3-540-35904-4, 9 p.Conference Paper

Metrics for labelled Markov processesDESHAMAIS, Josée; GUPTA, Vineet; JAGADEESAN, Radha et al.Theoretical computer science. 2004, Vol 318, Num 3, pp 323-354, issn 0304-3975, 32 p.Article

Approximating labelled Markov processesDESHARNAIS, Josée; GUPTA, Vineet; JAGADEESAN, Radha et al.Information and computation (Print). 2003, Vol 184, Num 1, pp 160-200, issn 0890-5401, 41 p.Article

Bisimulation for labelled Markov processesDESHARNAIS, Josée; EDALAT, Abbas; PANANGADEN, Prakash et al.Information and computation (Print). 2002, Vol 179, Num 2, pp 163-193, issn 0890-5401, 31 p.Article

Computational Structures for Modelling Space, Time and CausalityKOPPERMAN, Ralf; PANANGADEN, Prakash; SMYTH, Michael B et al.Theoretical computer science. 2008, Vol 405, Num 1-2, issn 0304-3975, 208 p.Conference Proceedings

Causal set topologySURYA, Sumati.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 188-197, issn 0304-3975, 10 p.Conference Paper

Topology in information theory in topologyMARTIN, Keye.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 75-87, issn 0304-3975, 13 p.Conference Paper

Finitary formal topologies and Stone's representation theoremCIRAULO, Francesco; SAMBIN, Giovanni.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 11-23, issn 0304-3975, 13 p.Conference Paper

Computational complexity of determining which statements about causality hold in different space-time modelsKREINOVICH, Vladik; KOSHELEVA, Olga.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 50-63, issn 0304-3975, 14 p.Conference Paper

Fine hierarchies and m-reducibilities in theoretical computer scienceSELIVANOV, Victor L.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 116-163, issn 0304-3975, 48 p.Conference Paper

A quotient-universal digital topologySLAPAL, Josef.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 164-175, issn 0304-3975, 12 p.Conference Paper

Anonymity protocols as noisy channelsCHATZIKOKOLAKIS, Konstantinos; PALAMIDESSI, Catuscia; PANANGADEN, Prakash et al.Information and computation (Print). 2008, Vol 206, Num 2-4, pp 378-401, issn 0890-5401, 24 p.Conference Paper

Metric spaces and FS-domainsLAWSON, Jimmie D.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 73-74, issn 0304-3975, 2 p.Conference Paper

The Zariski spectrum as a formal geometrySCHUSTER, Peter.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 101-115, issn 0304-3975, 15 p.Conference Paper

Weak bisimulation is sound and complete for PCTLDESHARNAIS, Josée; GUPTA, Vineet; JAGADEESAN, Radha et al.Lecture notes in computer science. 2002, pp 355-370, issn 0302-9743, isbn 3-540-44043-7, 16 p.Conference Paper

Finite relational structure models of topological spaces and mapsHARDIE, K. A; WITBOOI, P. J.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 24-34, issn 0304-3975, 11 p.Conference Paper

Information systems revisited : the general continuous caseSPREEN, Dieter; LUOSHAN XU; XUXIN MAO et al.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 176-187, issn 0304-3975, 12 p.Conference Paper

Apartness, compactness and nearnessBRIDGES, Douglas; ISHIHARA, Hajime; SCHUSTER, Peter M et al.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 3-10, issn 0304-3975, 8 p.Conference Paper

Static space-times naturally lead to quasi-pseudometricsKÜNZI, Hans-Peter A; KREINOVICH, Vladik.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 64-72, issn 0304-3975, 9 p.Conference Paper

Modeling time and topology for animation and visualization with examples on parametric geometryJORDAN, K. E; MILLER, Lance E; MOORE, E. L. F et al.Theoretical computer science. 2008, Vol 405, Num 1-2, pp 41-49, issn 0304-3975, 9 p.Conference Paper